Tame Combing and Almost Convexity Conditions
نویسندگان
چکیده
We explore relationships between the family of successively weaker almost convexity conditions, and successively weaker tame combing conditions. We show that both Thompson’s group F and the Baumslag-Solitar groups BS(1, p) with p ≥ 3 admit a tame combing with a linear radial tameness function. By earlier work of Belk and Bux showing that F is not minimally almost convex, and of Elder and Hermiller showing that BS(1, p) with p ≥ 7 is not minimally almost convex, in each case with respect to a standard generating set, this result provides examples of groups and generating sets satisfying a strong tame combing condition yet not even the weakest almost convexity condition on the same generating set. We also show that an inclusion on strong tame combing conditions is strict by showing that although BS(1, p) with the standard generators and p ≥ 8 does admit a tame combing with a linear radial tameness function, the linear coefficient of the tameness function must be greater than 1.
منابع مشابه
Tame combings, almost convexity and rewriting systems for groups
A finite complete rewriting system for a group is a finite presentation which gives an algorithmic solution to the word problem. Finite complete rewriting systems have proven to be useful objects in geometric group theory, yet little is known about the geometry of groups admitting such rewriting systems. We show that a group G with a finite complete rewriting system admits a tame 1-combing; it ...
متن کاملTame Nonsmooth Inverse Mapping Theorems
We give several versions of local and global inverse mapping theorem for tame non necessarily smooth, mappings. Here tame mapping means a mapping which is subanalytic or, more generally, definable in some o-minimal structure. Our sufficient conditions are formulated in terms of various properties (convexity, positivity of some principal minors, contractiblity) of the space of Jacobi’s matrices ...
متن کاملStackable Groups, Tame Filling Invariants, and Algorithmic Properties of Groups
We introduce a combinatorial property for finitely generated groups called stackable that implies the existence of an inductive procedure for constructing van Kampen diagrams with respect to a canonical finite presentation. We also define algorithmically stackable groups, for which this procedure is an effective algorithm. This property gives a common model for algorithms arising from both rewr...
متن کاملCERTAIN SUFFICIENT CONDITIONS FOR CLOSE-TO-CONVEXITY OF ANALYTIC FUNCTIONS
The object of this paper to derive certain sucient condi-tions for close-to-convexity of certain analytic functions dened on theunit disk
متن کاملTame Loci of Generalized Local Cohomology Modules
Let $M$ and $N$ be two finitely generated graded modules over a standard graded Noetherian ring $R=bigoplus_{ngeq 0} R_n$. In this paper we show that if $R_{0}$ is semi-local of dimension $leq 2$ then, the set $hbox{Ass}_{R_{0}}Big(H^{i}_{R_{+}}(M,N)_{n}Big)$ is asymptotically stable for $nrightarrow -infty$ in some special cases. Also, we study the torsion-freeness of graded generalized local ...
متن کامل